منابع مشابه
Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion
We present extensions of our Isabelle Formalization of Rewriting that cover two historically related concepts: the Knuth-Bendix order and the Knuth-Bendix completion procedure. The former, besides being the first development of its kind in a proof assistant, is based on a generalized version of the Knuth-Bendix order. We compare our version to variants from the literature and show all propertie...
متن کاملOn Transfinite Knuth-Bendix Orders
In this paper we discuss the recently introduced transfinite Knuth-Bendix orders. We prove that any such order with finite subterm coefficients and for a finite signature is equivalent to an order using ordinals below ω, that is, finite sequences of natural numbers of a fixed length. We show that this result does not hold when subterm coefficients are infinite. However, we prove that in this ge...
متن کاملSchur Operators and Knuth Correspondences
The paper presents a general combinatorial approach to the Schur functions and their modiications, respective generalized Cauchy identities, and bijective Knuth-type correspondences between matrices and pairs of tableaux. All of these appear whenever one has a pair of graphs with the same vertices such that the linear operators associated with these graphs satisfy a certain type of commutation ...
متن کاملLie Elements and Knuth Relations
A coplactic class in the symmetric group Sn consists of all permutations in Sn with a given Schensted Q-symbol, and may be described in terms of local relations introduced by Knuth. Any Lie element in the group algebra of Sn which is constant on coplactic classes is already constant on descent classes. As a consequence, the intersection of the Lie convolution algebra introduced by Patras and Re...
متن کاملKBCV - Knuth-Bendix Completion Visualizer
This paper describes a tool for Knuth-Bendix completion. In its interactive mode the user only has to select the orientation of equations into rewrite rules; all other computations (including necessary termination checks) are performed internally. Apart from the interactive mode, the tool also provides a fully automatic mode. Moreover, the generation of (dis)proofs in equational logic is suppor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Polar Record
سال: 1996
ISSN: 0032-2474,1475-3057
DOI: 10.1017/s0032247400067735